Bounds on the Distance Energy and the Distance Estrada Index of Strongly Quotient Graphs
نویسندگان
چکیده
منابع مشابه
Bounds on the Distance Energy and the Distance Estrada Index of Strongly Quotient Graphs
The notion of strongly quotient graph (SQG) was introduced by Adiga et al. (2007). In this paper, we obtain some better results for the distance energy and the distance Estrada index of any connected strongly quotient graph (CSQG) as well as some relations between the distance Estrada index and the distance energy. We also present some bounds for the distance energy and the distance Estrada ind...
متن کاملBounds of distance Estrada index of graphs
Let λ1, λ2, · · · , λn be the eigenvalues of the distance matrix of a connected graph G. The distance Estrada index of G is defined as DEE(G) = ∑ n i=1 ei . In this note, we present new lower and upper bounds for DEE(G). In addition, a Nordhaus-Gaddum type inequality for DEE(G) is given. MSC 2010: 05C12, 15A42.
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملAlbertson energy and Albertson Estrada index of graphs
Let $G$ be a graph of order $n$ with vertices labeled as $v_1, v_2,dots , v_n$. Let $d_i$ be the degree of the vertex $v_i$ for $i = 1, 2, cdots , n$. The Albertson matrix of $G$ is the square matrix of order $n$ whose $(i, j)$-entry is equal to $|d_i - d_j|$ if $v_i $ is adjacent to $v_j$ and zero, otherwise. The main purposes of this paper is to introduce the Albertson ...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2013
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2013/681019